Iterative Soft-Decision Decoding of Binary Cyclic Codes

Iterative Algebraic Soft Decision Decoding of Reed-Solomon Codes

In this paper, we propose an iterative soft decision decoding scheme for Reed Solomon codes with near maximum likelihood performance. The advantage of this decoding algorithm over previously proposed algorithms is its fast convergence in terms of the number of iterations required. This is achieved by combining two powerful soft decision decoding techniques which were previously regarded in the ...

Soft-decision decoding of binary linear block codes based on an iterative search algorithm

Bounded-Distance Soft Decision Decoding of Binary Product Codes

A. two-step sub-optimal algorithm for decoding binary product codes is discussed. This algorithm realizes at least half the minimum Euclidean distance of the code. The fundamental geometric properties associated with the algorithm are investigated, and bounds on the number of nearest neighbors are derived. This investigation also results with an improved algorithm which achieves the minimum eff...

“Look-Ahead” Soft-Decision Decoding of Binary Reed-Muller Codes

We investigate the performance of a stack algorithm to decode binary Reed-Muller codes. As metric to evaluate the different elements in the stack we use a recently derived lower bound on the squared Euclidean distance. Similar to the A -algorithm the new metric comprises a lower bound on the increase of the squared Euclidean distance in future decoding steps. Simulation results show that in cas...

Architectural Issues of Soft-Decision Iterative Decoders for Binary Cyclic Codes

The Tanner graph associated with an extended parity-check (EPC) matrix of a cyclic code is shown to be useful in effectively implementing soft decision iterativedecoding procedures based on belief propagation. Decoding with an EPC matrix has the advantage that is universal, in the sense that it does not depend on the specific family of cyclic codes being used. It is shown that there is no need ...